Quantifier elimination for o-minimal structures expanded by a valuational cut
نویسندگان
چکیده
Let R be an o-minimal expansion of a group in language which Th(R) eliminates quantifiers, and let C predicate for valuational cut R. We identify condition that implies quantifier elimination Th(R,C) the expanded by small number constants, which, turn, is implied having being universally axiomatizable. The applies example case when convex subring field its residue o-minimal.
منابع مشابه
Model completeness of o-minimal structures expanded by Dedekind cuts
Contents 1. Introduction. 2. Heirs. 3. The invariance group of a cut. 4. Review of T-convex valuation rings. 5. The invariance valuation ring of a cut. 6. A method for producing cuts with prescribed signature. 7. Existentially closed extensions. 1. Introduction. Let M be a totally ordered set. A (Dedekind) cut p of M is a couple (p L , p R) of subsets p L , p R of M such that p L ∪ p R = M and ...
متن کاملOn expansions of weakly o-minimal non-valuational structures by convex predicates
We prove that if M = (M,≤,+, . . .) is a weakly o-minimal non-valuational structure expanding an ordered group (M,≤,+), then its expansion by a family of ‘non-valuational’ unary predicates remains non-valuational. The paper is based on the author’s earlier work on strong cell decomposition for weakly o-minimal non-valuational expansions of ordered groups.
متن کاملOn Weakly O-minimal Non-valuational Expansions of Ordered Groups
Let M = 〈M,<,+, . . .〉 be a weakly o-minimal expansion of an ordered group. This paper has two parts. In the rst part, we introduce the notion of M having no external limits and use it to prove that a large collection of non-valuational structures M do not admit de nable Skolem functions. In the second part, we provide an alternative characterization of the canonical o-minimal completion from [...
متن کاملThe Role of Quantifier Alternations in Cut Elimination
Extending previous results from the author’s master’s thesis, subsequently published in the proceedings of CSL 2003, on the complexity of cut elimination for the sequent calculus LK, we discuss the role of quantifier alternations and develope a measure to describe the complexity of cut elimination in terms of quantifier alternations in cut formulas and contractions on such formulas.
متن کاملQuantifier Elimination for Quartics
Concerning quartics, two particular quantifier elimination (QE) problems of historical interests and practical values are studied. We solve the problems by the theory of complete discrimination systems and negative root discriminant sequences for polynomials that provide a method for real (positive/negative) and complex root classification for polynomials. The equivalent quantifier-free formula...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2023
ISSN: ['0168-0072', '1873-2461']
DOI: https://doi.org/10.1016/j.apal.2022.103206